Exact Bounds for the Stochastic Upward Matching Problem

Improved bounds for stochastic matching

This results in this paper have been merged with the result in arXiv:1003.0167. The authors would like to withdraw this version. Please see arXiv:1008.5356 for the merged version.

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

The stochastic matching problem

Improved Bounds for Online Stochastic Matching

We study the online stochastic matching problem in a form motivated by Internet display advertisement. Recently, Feldman et al. gave an algorithm that achieves 0.6702 competitive ratio, thus breaking through the 1−1/e barrier. One of the questions left open in their work is to obtain a better competitive ratio by generalizing their two suggested matchings (TSM) algorithm to d-suggested matching...

An exact Method for Stochastic Maximal Covering Problem of Preventive Healthcare Facilities

Effective preventive healthcare services have a significant role in reducing fatality and medical expenses in all human societies and the level of accessibility of customers to these services can be considered as a measure of their efficiency and effectiveness. The main purpose of this paper is to develop a service network design model of preventive healthcare facilities with the principal obje...